Simple deterministic wildcard matching
نویسندگان
چکیده
We present a simple and fast deterministic solution to the string matching with don’t cares problem. The task is to determine all positions in a text where a pattern occurs, allowing both pattern and text to contain single character wildcards. Our algorithm takes O(n logm) time for a text of length n and a pattern of length m and in our view the algorithm is conceptually simpler than previous approaches.
منابع مشابه
From coding theory to efficient pattern matching
We consider the classic problem of pattern matching with few mismatches in the presence of promiscuously matching wildcard symbols. Given a text t of length n and a pattern p of length m with optional wildcard symbols and a bound k, our algorithm finds all the alignments for which the pattern matches the text with Hamming distance at most k and also returns the location and identity of each mis...
متن کاملHierarchical Matching Beats The Non-Wildcard and Interpretation Tree Model Matching Algorithms
In Fisher[l] we introduced a non-wildcard model matching algorithm that has speed advantages over the standard Interpretation Tree model matching algorithm. This paper describes a hierarchical model-matching algorithm that has improved performance over both the standard and non-wildcard algorithms.
متن کاملSWiM: Secure Wildcard Pattern Matching From OT Extension
Suppose a server holds a long text string and a receiver holds a short pattern string. Secure pattern matching allows the receiver to learn the locations in the long text where the pattern appears, while leaking nothing else to either party besides the length of their inputs. In this work we consider secure wildcard pattern matching (WPM), where the receiver’s pattern is allowed to contain wild...
متن کاملA Semi-Analytical Method for History Matching and Improving Geological Models of Layered Reservoirs: CGM Analytical Method
History matching is used to constrain flow simulations and reduce uncertainty in forecasts. In this work, we revisited some fundamental engineering tools for predicting waterflooding behavior to better understand the flaws in our simulation and thus find some models which are more accurate with better matching. The Craig-Geffen-Morse (CGM) analytical method was used to predict recovery performa...
متن کاملHierarchical Matching Beats
In Fisherr1] we introduced a non-wildcard model matching algorithm that has speed advantages over the standard Interpretation Tree model matching algorithm. This paper describes a hierarchical model-matching algorithm that has improved performance over both the standard and non-wildcard algorithms.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 101 شماره
صفحات -
تاریخ انتشار 2007